Iterated local search using an add and delete hyper-heuristic for university course timetabling
نویسندگان
چکیده
منابع مشابه
Iterated local search using an add and delete hyper-heuristic for university course timetabling
Hyper-heuristics are (meta-)heuristics that operate at a higher level to choose or generate a set of low-level (meta-)heuristics in an attempt of solve difficult optimization problems. Iterated Local Search (ILS) is a well-known approach for discrete optimization, combining perturbation and hill-climbing within an iterative framework. In this study, we introduce an ILS approach, strengthened by...
متن کاملA Simulated Annealing Hyper-heuristic for University Course Timetabling
The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...
متن کاملHySST: Hyper-heuristic Search Strategies and Timetabling
High school timetabling (HST) is a well-known real-world combinatorial optimisation problem. It requires the scheduling of events and resources, such as courses, classes of students, teachers, rooms and more within a fixed number of time slots subject to a set of constraints. In a standard fashion, constraints are separated into ‘hard’ and soft. The hard constraints must be satisfied in order t...
متن کاملHyperILS: An Effective Iterated Local Search Hyper-heuristic for Combinatorial Optimisation
Two powerful ideas from search methodologies, iterated local search and hyperheuristics, are combined into a simple and effective framework to solve combinatorial optimisation problems (HyperILS). Iterated local search is a simple but successful algorithm. It operates by iteratively alternating between applying a move operator to the incumbent solution and restarting local search from the pertu...
متن کاملuniversity course timetabling using graph-based hyper heuristics
university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2016
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2015.11.043